An Optimal Routing Strategy Based on Specifying Shortest Path
نویسندگان
چکیده
Unlike the shortest path is randomly chosen in the traditional shortest path routing strategy, a novel routing strategy to improve the network transportation capacity is proposed in this paper. According to the different characteristics of the nodes along actual paths, we specify the shortest paths of all pairs of nodes aiming at reducing the betweenness of those high-betweenness nodes. Simulations on both computer-generated and real-world networks show that the new routing strategy can enhance the network transportation capacity greatly. And it works better in those networks with the fuzzy community structure.
منابع مشابه
Shortest-path and Hot-potato Routing on Unbuuered 2-d Tori
We probabilistically model dynamic routing on un-buuered 2-dimensional tori. We consider shortest-path routing with packet loss and retransmissions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node through-put, and average packet latency indicate that the proposed ALB strategy is a much bett...
متن کاملShortest-path and Hot-potato Routing on Unbuuered Toroidal Networks
We probabilistically model dynamic packet routing on unbuuered 2-D and 3-D toroidal networks. We consider shortest-path routing with packet loss and retrans-missions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node throughput, and average packet latency indicate that the proposed ALB strate...
متن کاملLoad-Balanced K-Shortest Path Routing for Circuit-Switched Networks
Issues of the load-balanced K-shortest path routing are investigated in this paper, including multiple alternative routing strategies, network loss performance, and optimal interval for network status updates. A max-min cost function for alternative path evaluation is applied to Least Loaded Routing model in circuitswitched networks. Two kinds of routing strategy which may update the network st...
متن کاملAcyclic orientations do not lead to optimal deadlock-free packet routing algorithms
In this paper we consider the problem of designing deadlock-free shortest-path routing algorithms. A design technique based on acyclic orientations has proven to be useful for many important topologies, e.g., meshes, tori, trees and hypercubes. It was not known whether this technique always leads to algorithms using an asymptotically optimal number of buffers. We show this is not the case by pr...
متن کاملIdentifying multiple optimal paths in Antnet Routing Algorithm with negligible Overhead
Antnet is an agent based routing algorithm based on real ants' behavior. Ants are able to find shortest path to food source .In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. But Antnet Algorithms may cause the network congestion and stagnation. Here, ...
متن کامل